Compositional verification by model checking for counter-examples
نویسندگان
چکیده
منابع مشابه
Compositional Veriication by Model Checking for Counter-examples
Many concurrent systems are required to maintain certain safety and liveness properties. One emerging method of achieving conndence in such systems is to statically verify them using model checking. In this approach an abstract, nite-state model of the system is constructed; then an automatic check is made to ensure that the requirements are satissed by the model. In practice, however, this met...
متن کاملMicroarchitecture Verification by Compositional Model Checking
Compositional model checking is used to verify a processor microarchitecture containing most of the features of a modern microprocessor, including branch prediction, speculative execution, out-of-order execution and a load-store buffer supporting re-ordering and load forwarding. We observe that the proof methodology scales well, in that the incremental proof cost of each feature is low. The pro...
متن کاملCompositional Veri cation by Model Checking for Counter - ExamplesTev
Many concurrent systems are required to maintain certain safety and liveness properties. One emerging method of achieving conndence in such systems is to statically verify them using model checking. In this approach an abstract, nite-state model of the system is constructed; then an automatic check is made to ensure that the requirements are satissed by the model. In practice, however, this met...
متن کاملRich Counter-Examples for Temporal-Epistemic Logic Model Checking
Model checking verifies that a model of a system satisfies a given property, and otherwise produces a counter-example explaining the violation. The verified properties are formally expressed in temporal logics. Some temporal logics, such as CTL, are branching: they allow to express facts about the whole computation tree of the model, rather than on each single linear computation. This branching...
متن کاملVerification of Infinite State Systems by Compositional Model Checking
A method of compositional verification is presented that uses the combination of temporal case splitting and data type reductions to reduce types of infinite or unbounded range to small finite types, and arrays of infinite or unbounded size to small fixed-size arrays. This supports the verification by model checking of systems with unbounded resources and uninterpreted functions. The method is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGSOFT Software Engineering Notes
سال: 1996
ISSN: 0163-5948
DOI: 10.1145/226295.226321